package cn.xdf.learn.leetcode.贪心算法;

public class Test {


    public int[] twoSum(int[] nums, int target) {
        int[] r = new int[2];
        for(int i = 0;i<nums.length;i++){
            for(int j = 0;j<nums.length;j++){
                if(nums[i] + nums[j] == target){
                    r[0] = i;
                    r[1] = j;
                }

            }
        }
        return r;

    }
}
